Constructive Genetic Algorithm for Clustering Problems
نویسندگان
چکیده
منابع مشابه
Constructive Genetic Algorithm for Clustering Problems
Genetic algorithms (GAs) have recently been accepted as powerful approaches to solving optimization problems. It is also well-accepted that building block construction (schemata formation and conservation) has a positive influence on GA behavior. Schemata are usually indirectly evaluated through a derived structure. We introduce a new approach called the Constructive Genetic Algorithm (CGA), wh...
متن کاملA constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) design, and can be described as a problem of assigning a set of circuit nodes (gates) in an optimal sequence, such that the layout area is minimized, as a consequence of optimizing the number of tracks necessary to cover ...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملHybrid Genetic Algorithm with K-Means for Clustering Problems
The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics...
متن کاملConstructive Genetic Algorithm for Graph Coloring
This work presents a new constructive heuristic for graph coloring based on Genetic Algorithms. The Constructive Genetic Algorithm (CGA) begins with an initial population formed only of schemas (partial colorings), and iterates (re)combining two schemas. The new schemas present more colored nodes. At each iteration, is performed an elimination of schemas from the population and the process fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2001
ISSN: 1063-6560,1530-9304
DOI: 10.1162/106365601750406019